децимация во времени
—
[http://slovarionline.ru/anglo_russkiy_slovar_neftegazovoy_promyishlennosti/]
Англо-русский словарь нормативно-технической терминологии. academic.ru. 2015.
Time-variant system — A time variant system is a system, that is not time invariant(TIV). Overview There are many well developed techniques for dealing with the response of linear time invariant systems, such as Laplace and Fourier transforms. However, these… … Wikipedia
Decimation (comics) — Decimation Decimation event logo, as shown on the covers of tie in comics Publisher Marvel Comics Publication date January – August 2006 … Wikipedia
Decimation (Roman army) — This article is part of the series on: Military of ancient Rome (portal) 753 BC – AD 476 Structural history Roman army (unit types and ranks … Wikipedia
Time-evolving block decimation — The time evolving block decimation (TEBD) algorithm is a numerical scheme used to simulate one dimensional quantum many body systems, characterized by at most nearest neighbour interactions.It is dubbed Time evolving Block Decimation because it… … Wikipedia
Decimation (signal processing) — This article is related to signal processing. For other meanings of the word Decimation, please see Decimation (disambiguation). In digital signal processing, decimation is a technique for reducing the number of samples in a discrete time signal … Wikipedia
Cooley–Tukey FFT algorithm — The Cooley–Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N1N2 in terms of smaller DFTs… … Wikipedia
Cooley-Tukey FFT algorithm — The Cooley Tukey algorithm, named after J.W. Cooley and John Tukey, is the most common fast Fourier transform (FFT) algorithm. It re expresses the discrete Fourier transform (DFT) of an arbitrary composite size N = N 1 N 2 in terms of smaller… … Wikipedia
Butterfly diagram — used for finding the most likely sequence of hidden states.Most commonly, the term butterfly appears in the context of the Cooley Tukey FFT algorithm, which recursively breaks down a DFT of composite size n = r m into r smaller transforms of size … Wikipedia
Bruun's FFT algorithm — Bruun s algorithm is a fast Fourier transform (FFT) algorithm based on an unusual recursive polynomial factorization approach, proposed for powers of two by G. Bruun in 1978 and generalized to arbitrary even composite sizes by H. Murakami in 1996 … Wikipedia
Split-radix FFT algorithm — The split radix FFT is a fast Fourier transform (FFT) algorithm for computing the discrete Fourier transform (DFT), and was first described in an obscure paper by R. Yavne (1968) and subsequently rediscovered simultaneously by various authors in… … Wikipedia
Discrete cosine transform — A discrete cosine transform (DCT) expresses a sequence of finitely many data points in terms of a sum of cosine functions oscillating at different frequencies. DCTs are important to numerous applications in science and engineering, from lossy… … Wikipedia
